An Adaptive Sparse Distributed Memory
نویسنده
چکیده
Sparse Distributed Memory is a content addressable, associative memory terhnique which relies on close memory items tending to be clustered together, with some abstraction and blurring of details. This paper discusses the limitations of the original model. Then, we propose a method which improve Sparse Distributed Memory efficiency through an adaptive threshold. The results obtained are good and promising.
منابع مشابه
Kanerva's Sparse Distributed Memory: An Object-Oriented Implementation on the Connection Machine
This paper reports on an implementation of Kanerva's Sparse Distributed Memory for the Connection Machine. In order to accomplish a modular and adaptive software library we applied a plain object-oriented programming style to the Common Lisp extension *ltsp. Some variations of the original model, the selected coordinate design, the hyperplane design, and a new general design, as well as the fol...
متن کاملThe Kanerva Machine: A Generative Distributed Memory
We present an end-to-end trained memory system that quickly adapts to new data and generates samples like them. Inspired by Kanerva’s sparse distributed memory, it has a robust distributed reading and writing mechanism. The memory is analytically tractable, which enables optimal on-line compression via a Bayesian update-rule. We formulate it as a hierarchical conditional generative model, where...
متن کاملAdaptive Tunable Vibration Absorber using Shape Memory Alloy
This study presents a new approach to control the nonlinear dynamics of an adaptive absorber using shape memory alloy (SMA) element. Shape memory alloys are classified as smart materials that can remember their original shape after deformation. Stress and temperature-induced phase transformations are two typical behaviors of shape memory alloys. Changing the stiffness associated with phase tran...
متن کاملCluster-based Communication and Load Balancing for Simulations on Dynamically Adaptive Grids
The present paper introduces a new communication and load-balancing scheme based on a clustering of the grid which we use for the efficient parallelization of simulations on dynamically adaptive grids. With a partitioning based on space-filling curves (SFCs), this yields several advantageous properties regarding the memory requirements and load balancing. However, for such an SFC-based partitio...
متن کاملTitle: Kanerva's Sparse Distributed Memory: an Object-oriented Implementation on the Connection Machine Authors: Kanerva's Sparse Distributed Memory: an Object-oriented Implementation on the Connection Machine
This paper reports on an implementation of Kanerva's Sparse Distributed Memory for the Connection Machine and its application. In order to achieve a maximum of modularity in a highly adaptive software library we applied a native object-oriented programming style (namely the message passing style) to the Common Lisp extension *lisp. Furthermore some variations of the original model, the selected...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004